Inexact GMRES for singular linear systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inexact GMRES for singular linear systems

Inexact Krylov subspace methods have been shown to be practical alternatives for the solution of certain linear systems of equations. In this paper, the solution of singular systems with inexact matrix-vector products is explored. Criteria are developed to prescribe how inexact the matrix-vector products can be, so that the computed residual remains close to the true residual, thus making the i...

متن کامل

Singular constrained linear systems

In the linear system Ax = b the points x are sometimes constrained to lie in a given subspace S of column space of A. Drazin inverse for any singular or nonsingular matrix, exist and is unique. In this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of Drazin inverse in solving such systems is investigated. Constrained linear system arise ...

متن کامل

Gmres on (nearly) Singular Systems

We consider the behavior of the GMRES method for solving a linear system Ax = b when A is singular or nearly so, i.e., ill conditioned. The (near) singularity of A may or may not affect the performance of GMRES, depending on the nature of the system and the initial approximate solution. For singular A, we give conditions under which the GMRES iterates converge safely to a least-squares solution...

متن کامل

Breakdown-free GMRES for Singular Systems

GMRES is a popular iterative method for the solution of large linear systems of equations with a square nonsingular matrix. When the matrix is singular, GMRES may break down before an acceptable approximate solution has been determined. This paper discusses properties of GMRES solutions at breakdown and presents a modification of GMRES to overcome the breakdown.

متن کامل

GGMRES: A GMRES--type algorithm for solving singular linear equations with index one

In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BIT Numerical Mathematics

سال: 2008

ISSN: 0006-3835,1572-9125

DOI: 10.1007/s10543-008-0171-2